Minimal reducible bounds for hom-properties of graphs

نویسندگان

Amelie J. Berger

Izak Broere

چکیده

Let H be a fixed finite graph and let → H be a hom-property, i.e. the set of all graphs admitting a homomorphism into H . We extend the definition of → H to include certain infinite graphs H and then describe the minimal reducible bounds for → H in the lattice of additive hereditary properties and in the lattice of hereditary properties.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal reducible bounds for induced-hereditary properties

Let (M ;⊆) and (L ;⊆) be the lattices of additive induced-hereditary properties of graphs and additive hereditary properties of graphs, respectively. A property R∈Ma (∈ L) is called a minimal reducible bound for a property P∈Ma (∈ L) if in the interval (P;R) of the lattice M (L) there are only irreducible properties. The set of all minimal reducible bounds of a property P∈Ma in the lattice M we...

متن کامل

Graphs maximal with respect to hom-properties

For a simple graph H, → H denotes the class of all graphs that admit homomorphisms to H (such classes of graphs are called homproperties). We investigate hom-properties from the point of view of the lattice of hereditary properties. In particular, we are interested in characterization of maximal graphs belonging to → H. We also provide a description of graphs maximal with respect to reducible h...

متن کامل

Minimal forbidden subgraphs of reducible graph properties

A property of graphs is any class of graphs closed under isomorphism. Let P1,P2, . . . ,Pn be properties of graphs. A graph G is (P1,P2, . . . ,Pn)-partitionable if the vertex set V (G) can be partitioned into n sets, {V1, V2, . . . , Vn}, such that for each i = 1, 2, . . . , n, the graph G[Vi] ∈ Pi. We write P1◦P2◦ · · · ◦Pn for the property of all graphs which have a (P1,P2, . . . ,Pn)-partit...

متن کامل

Hom complexes and homotopy theory in the category of graphs

We investigate a notion of ×-homotopy of graph maps that is based on the internal hom associated to the categorical product in the category of graphs. It is shown that graph ×homotopy is characterized by the topological properties of the Hom complex, a functorial way to assign a poset (and hence topological space) to a pair of graphs; Hom complexes were introduced by Lovász and further studied ...

متن کامل